Small Lifts of Expander Graphs are Expanding
نویسندگان
چکیده
A k-lift of an n-vertex base-graph G is a graph H on n× k vertices, where each vertex of G is replaced by k vertices and each edge (u, v) in G is replaced by a matching representing a bijection πuv so that the edges of H are of the form ( (u, i), (v, πuv(i)) ) . H is a (uniformly) random lift of G if for every edge (u, v) the bijection πuv is chosen uniformly and independently at random. The main motivation for studying lifts has been understanding Ramanujan expander graphs via two key questions: Is a “typical” lift of an expander graph also an expander; and how can we (efficiently) construct Ramanujan expanders using lifts? Lately, there has been an increased interest in lifts and their close relation to the notorious Unique Games Conjecture [Kho02]. In this paper, we analyze the spectrum of random k-lifts of d-regular graphs. We show that, for random shift k-lifts, if all the nontrivial eigenvalues of the base graph G are at most λ in absolute value, then with high probability depending only on the number n of nodes of G (and not on k), the absolute value of every nontrivial eigenvalue of the lift is at most O(λ). Moreover, if G is moderately expanding, then this bound can be improved to λ +O( √ d). While previous results on random lifts were asymptotically true with high probability in the degree of the lift k, our result is the first upperbound on spectra of lifts for bounded k. In particular, it implies that a typical small lift of a Ramanujan graph is almost Ramanujan, and we believe it will prove crucial in constructing large Ramanujan expanders of all degrees. We also establish a novel characterization of the spectrum of shift lifts by the spectrum of certain k symmetric matrices, that generalize the signed adjacency matrix (e.g. see [BL06]). We believe this characterization is of independent interest. ∗[email protected], University of Illinois Urbana-Champaign †[email protected], University of Illinois Urbana-Champaign ‡[email protected], University of Illinois Urbana-Champaign
منابع مشابه
Expansion in Lifts of Graphs
The central goal of this thesis is to better understand, and explicitly construct, expanding towers G1,G2, . . ., which are expander families with the additional constraint that Gn+1 is a lift of Gn . A lift G of H is a graph that locally looks like H , but may be globally di erent; lifts have been proposed as a more structured setting for elementary explicit constructions of expanders, and the...
متن کاملLifts, derandomization, and diameters of Schreier graphs of Mealy automata
It is known that random 2-lifts of graphs give rise to expander graphs. We present a new conjectured derandomization of this construction based on certain Mealy automata. We verify that these graphs have polylogarithmic diameter, and present a class of automata for which the same is true. However, we also show that some automata in this class do not give rise to expander graphs.
متن کاملLocally Testable Codes and Expanders
A locally testable code is a code defined by a robust set of local constraints. Namely, the distance of a vector from the code is well approximated by the fraction of local constraints that it violates. A constraint graph of an LTC is a graph whose vertices are labeled by the coordinates of the code, and vertex i is adjacent to j whenever they occur together in a constraint. We study the relati...
متن کاملThe Robust Component Structure of Dense Regular Graphs and Applications
In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a graph is robustly expanding if it still expands after the deletion of a small fraction of its vertices and edges. Our main result allows us to harness the us...
متن کاملExpander graphs based on GRH with an application to elliptic curve cryptography
We present a construction of expander graphs obtained from Cayley graphs of narrow ray class groups, whose eigenvalue bounds follow from the Generalized Riemann Hypothesis. Our result implies that the Cayley graph of (Z/qZ)∗ with respect to small prime generators is an expander. As another application, we show that the graph of small prime degree isogenies between ordinary elliptic curves achie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1311.3268 شماره
صفحات -
تاریخ انتشار 2013